Efficient handling of data structures in definitional languages
نویسندگان
چکیده
منابع مشابه
Efficient Data Representation in Polymorphic Languages
Languages with polymorphic types (e.g. ML) have traditionally been implemented using Lisp-like data representations—everything has to fit in one word, if necessary by being heap-allocated and handled through a pointer. The reason is that, in contrast with conventional statically-typed languages such as Pascal, it is not possible to assign one unique type to each expression at compile-time, an a...
متن کاملOn Efficient Handling of Continuous Attributes in Large Data Bases
Some data mining techniques, like discretization of continuous attributes or decision tree induction, are based on searching for an optimal partition of data with respect to some optimization criteria. We investigate the problem of searching for optimal binary partition of continuous attribute domain in case of large data sets stored in relational data bases (RDB). The critical for time complex...
متن کاملEfficient Algorithms and Data Structures
The proposed project will address some of the fundamental issues in efficient algorithms and data structures, ranging from pseudo-random hashing, to the existence of deterministic dictionaries with constant update and look-up time, to graph algorithms. The applicant is a leading figure in the area of efficient algorithms and data structures. For the last 14 years he has been in the USA where th...
متن کاملWorst Case Efficient Data Structures
We study the design of efficient data structures. In particular we focus on the design of data structures where each operation has a worst case efficient implementations. The concrete problems we consider are partial persistence, implementation of priority queues, and implementation of dictionaries. The first problem we consider is how to make bounded in-degree and out-degree data structures pa...
متن کاملEfficient error-correcting data structures
We are interested in constructing efficient data structures that still work (most of the time) when hit by a constant fraction of adversarial noise. Roughly speaking, by “efficient” we mean constructions that are simultaneously close to the optimal time and space for the noiseless case. Recently, de Wolf [20] introduced a model for this, called “error-correcting data structures,” and studied th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 1988
ISSN: 0167-6423
DOI: 10.1016/0167-6423(88)90050-0